Running time Analysis of Sorting Algorithm via an Asymptotic Distribution

Sorting data is one of the most important problems that play an important rule in many applications in operations research and computer science. Many sorting algorithms are well studied but the problem is not to find a way or algorithm to sort elements, but to find an efficiently way to sort elements. The output is a stream of data in time. We are interested in this flow of data. For the performance of such algorithms, there has been little research on their stochastic behavior and mathematical properties.In this paper we study the mathematical behavior of some different versions sorting algorithms. We also discuss the corresponding running time using some different strategies.